Every Large Point Set contains Many Collinear Points or an Empty Pentagon
نویسندگان
چکیده
We prove the following generalised empty pentagon theorem: for every integer ` ≥ 2, every sufficiently large set of points in the plane contains ` collinear points or an empty pentagon. As an application, we settle the next open case of the “big line or big clique” conjecture of Kára, Pór, and Wood [Discrete Comput. Geom. 34(3):497–506, 2005].
منابع مشابه
Empty pentagons in point sets with collinearities
An empty pentagon in a point set P in the plane is a set of five points in P in strictly convex position with no other point of P in their convex hull. We prove that every finite set of at least 328` points in the plane contains an empty pentagon or ` collinear points. This is optimal up to a constant factor since the (` − 1) × (` − 1) grid contains no empty pentagon and no ` collinear points. ...
متن کاملDisjoint empty convex pentagons in planar point sets
Harborth [Elemente der Mathematik, Vol. 33 (5), 116–118, 1978] proved that every set of 10 points in the plane, no three on a line, contains an empty convex pentagon. From this it follows that the number of disjoint empty convex pentagons in any set of n points in the plane is least ⌊ n 10 ⌋. In this paper we prove that every set of 19 points in the plane, no three on a line, contains two disjo...
متن کاملProgress on Dirac's Conjecture
In 1951, Gabriel Dirac conjectured that every set P of n non-collinear points in the plane contains a point in at least n 2 − c lines determined by P , for some constant c. The following weakening was proved by Beck and Szemerédi–Trotter: every set P of n non-collinear points contains a point in at least n c lines determined by P , for some large unspecified constant c. We prove that every set ...
متن کاملEmpty Convex Hexagons in Planar Point Sets
Erdős asked whether every sufficiently large set of points in general position in the plane contains six points that form a convex hexagon without any points from the set in its interior. Such a configuration is called an empty convex hexagon. In this paper, we answer the question in the affirmative. We show that every set that contains the vertex set of a convex 9-gon also contains an empty co...
متن کاملCombinatorial geometry of point sets with collinearities
In this thesis we study various combinatorial problems relating to the geometry of point sets in the Euclidean plane. The unifying theme is that all the problems involve point sets that are not in general position, but have some collinearities. As well as giving rise to natural and interesting problems, the study of point sets with collinearities has important connections to other areas of math...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 27 شماره
صفحات -
تاریخ انتشار 2009